Nice work!

I didn't see any comments or description that shared the time and space complexity of your algorithm. As we saw in class when we discussed the first few slides in https://drive.google.com/file/d/0B__DV26QHsH4bWJmS1A0QXBad1U/view?usp=sharing, the space complexity of your algorithm will be O(n). The time complexity of your algorithm will be O(n).

Also, to see a different approach with O(1) space complexity, take a look at https://github.com/Ada-C10/reverse_words/blob/solution/lib/reverse_words.rb

Slack me if you have questions on either.